High-Level Filtering for Arrangements of Conic Arcs
نویسنده
چکیده
Acknowledgements I wish to thank Prof. Dan Halperin for his guidance and his help during the work on this thesis. I thank all the Cgal members in Tel-Aviv University for useful discussions and exchange of ideas.
منابع مشابه
High-Level Filtering for Arrangements
Many computational geometry algorithms involve the construction and maintenance of planar arrangements of conic arcs. Implementing a general, robust arrangement package for conic arcs handles most practical cases of planar arrangements covered in literature. A possible approach for implementing robust geometric algorithms is to use exact algebraic number types — yet this may lead to a very slow...
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology An Experimental Study of Point Location in General Planar Arrangements
We study the performance in practice of various point-location algorithms implemented in cgal, including a newly devised Landmarks algorithm. Among the other algorithms studied are: a näıve approach, a “walk along a line” strategy and a trapezoidal-decomposition based search structure. The current implementation addresses general arrangements of arbitrary planar curves, including arrangements o...
متن کاملA Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
We give an exact geometry kernel for conic arcs, algorithms for exact computation with low-degree algebraic numbers, and an algorithm for computing the arrangement of conic arcs that immediately leads to a realization of regularized boolean operations on conic polygons. A conic polygon, or polygon for short, is anything that can be obtained from linear or conic halfspaces (= the set of points w...
متن کاملSweeping Arrangements of Cubic Segments Exactly and Efficiently
A method is presented to compute the planar arrangement induced by segments of algebraic curves of degree three (or less), using an improved Bentley-Ottmann sweep-line algorithm. Our method is exact (it provides the mathematically correct result), complete (it handles all possible geometric degeneracies), and efficient (the implementation can handle hundreds of segments). The range of possible ...
متن کاملOn Left Regular Bands and Real Conic-line Arrangements
An arrangement of curves in the real plane divides it into a collection of faces. Already in the case of line arrangements, this collection can be given a structure of a left regular band and one can ask whether the same is possible for other arrangements. In this paper, we try to answer this question for the simplest generalization of line arrangements, that is, conic–line arrangements. Invest...
متن کامل